R-DFS: A Coverage Path Planning Approach Based on Region Optimal Decomposition

نویسندگان

چکیده

Most Coverage Path Planning (CPP) strategies based on the minimum width of a concave polygonal area are very likely to generate non-optimal paths with many turns. This paper introduces CPP method Region Optimal Decomposition (ROD) that overcomes this limitation when applied path planning an Unmanned Aerial Vehicle (UAV) in port environment. The principle approach is first apply ROD Google Earth image and combining resulting sub-regions by improved Depth-First-Search (DFS) algorithm. Finally, genetic algorithm determines traversal order all sub-regions. simulation experiments show combination DFS can reduce number turns 4.34%, increase coverage rate more than 10%, shorten non-working distance about 29.91%. Overall, whole provides sound solution for operations UAVs environments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decomposition Approach for the Complete Coverage Path Planning Problem

In this paper, a complete coverage path planning problem is discussed, for application in real situations in the areas of agriculture, autonomous robotic house cleaning, and hydrographic survey. Since the approach to this problem is currently being developed, only the work developed so far is presented. In this problem one aims to find the most efficient path or circuit that completely covers a...

متن کامل

Coverage Path Planning: The Boustrophedon Cellular Decomposition

Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, oor scrubbing, and inspection. We developed the boustrophedon cellular decomposition, which is an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon is covered with simple back and forth ...

متن کامل

Optimal Control for Constrained Coverage Path Planning

The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the ef...

متن کامل

Partial Field Coverage Based on Two Path Planning Patterns

This paper presents a path planning method for partial field coverage. We therefore propose to use a specific path planning pattern. Guiding notion is that lighter machinery with smaller storage tanks can alleviate soil compaction, but does not permit to cover a given field in a single run, for example, during a spraying application. Instead, multiple returns to a mobile or stationary depot loc...

متن کامل

Visibility-based Optimal Path and Motion Planning

No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in deadline time. Reading will encourage your mind and thoughts. Of course, reading will greatly develop your experiences about everything. Reading visibility based optimal path and motion planning is also a way as one of the collective books that gives many advantages. The a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Remote Sensing

سال: 2021

ISSN: ['2315-4632', '2315-4675']

DOI: https://doi.org/10.3390/rs13081525